

public class EulerProblem5 {

      boolean isItPrime(long possiblePrimeNumber){
        for(int i=2; i<=Math.sqrt(possiblePrimeNumber);i++)
        {
//            System.out.println("i " + i +"pos"+ possiblePrimeNumber);
            if(possiblePrimeNumber%i==0){
                return false;
            }
        }
        return true;
    }

    public static void main (String []arg){
//        long []in =new long[20];
        int product =1;
        for(int i=2;i<20;i++){
           if(new EulerProblem5().isItPrime(i)){
               System.out.println(i);
            product=product*i;
               System.out.println(product);
           }
        }
        System.out.println("product " + product);
        System.out.println(9699690*8*3);
    }
}
      /* public class problemFive {
	public static void main(String[] args) {
		System.out.println(lcm(10));
		System.out.println(lcm(20));
	}
	public static boolean isPrime(int n){
		for(int i=2;i<n/2+1;i++){
			if(n%i==0)return false;
		}
		return true;
	}
public static int lcm(int num){
	int product=1,j;
	for(int i=2;i<num;i++){
	if(isPrime(i)){
	j=i;
	while(j<=num)j*=i;
	j/=i; //this is to cancel the last j*=i
	product*=j;
	}
	}
	return product;
}
}*/